MINQ8: general definite and bound constrained indefinite quadratic programming
نویسندگان
چکیده
منابع مشابه
Bound constrained quadratic programming via piecewise quadratic functions
We consider the strictly convex quadratic programming problem with bounded variables. A dual problem is derived using Lagrange duality. The dual problem is the minimization of an unconstrained, piecewise quadratic function. It involves a lower bound of λ1, the smallest eigenvalue of a symmetric, positive definite matrix, and is solved by Newton iteration with line search. The paper describes th...
متن کاملP , Sequential Quadratic Constrained Quadratic Programming
We follow the popular approach for unconstrained minimization, i.e. we develop a local quadratic model at a current approximate minimizer in conjunction with a trust region. We then minimize this local model in order to nd the next approximate minimizer. Asymptot-ically, nding the local minimizer of the quadratic model is equivalent to applying Newton's method to the stationarity condition. For...
متن کاملGlobal Optimization Algorithms for Linearly Constrained Indefinite Quadratic Problems
1. I N T R O D U C T I O N Global optimization of constrained quadratic problems has been the subject of active research during the last two decades. Quadratic programming is a very old and important problem of optimization. It has numerous applications in many diverse fields of science and technology and plays a key role in many nonlinear programming methods. Nonconvex quadratic programming re...
متن کاملApproximating quadratic programming with bound and quadratic constraints
We consider the problem of approximating the global maximum of a quadratic program (QP) subject to bound and (simple) quadratic constraints. Based on several early results, we show that a 4=7-approximate solution can be obtained in polynomial time.
متن کاملSubspace Accelerated Matrix Splitting Algorithms for Bound-constrained Quadratic Programming and Linear Complementarity Problems
This paper studies the solution of two problems—bound-constrained quadratic programs and linear complementarity problems—by two-phase methods that consist of an active set prediction phase and a subspace phase. The algorithms enjoy favorable convergence properties under weaker assumptions than those assumed for other methods in the literature. The active set prediction phase employs matrix spli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2017
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-017-9949-y